A Parallel Algorithm to Evaluate Chebyshev Series on a Message Passing Environment
نویسندگان
چکیده
A simple parallel algorithm for the evaluation of polynomials written in the Chebyshev form is introduced. By this method only 2 ⌈log2(p−2)⌉+ ⌈log2 p⌉+4 ⌈N/p⌉−7 steps on p processors are needed to evaluate a Chebyshev series of degree N . Theoretical analysis of the efficiency is performed and some numerical examples on a CRAY T3D are shown.
منابع مشابه
A Message-Passing Distributed Memory Parallel Algorithm for a Dual-Code Thin Layer, Parabolized Navier-Stokes Solver
In this study, the results of parallelization of a 3-D dual code (Thin Layer, Parabolized Navier-Stokes solver) for solving supersonic turbulent flow around body and wing-body combinations are presented. As a serial code, TLNS solver is very time consuming and takes a large part of memory due to the iterative and lengthy computations. Also for complicated geometries, an exceeding number of grid...
متن کاملEvaluating the Performance of Parallel Programs in a Pseudo - Parallel MPIEnvironmentByErik
OF PAPER Evaluating the Performance of Parallel Programs in a Pseudo-Parallel MPI Environment By Erik Demaine This paper presents a system for use with the message-passing standard called MPI (Message Passing Interface) that provides a means of automatically simulating a distributed-memory parallel program. This allows one to evaluate a parallel algorithm without the use of a parallel computer....
متن کاملParleda: a Library for Parallel Processing in Computational Geometry Applications
ParLeda is a software library that provides the basic primitives needed for parallel implementation of computational geometry applications. It can also be used in implementing a parallel application that uses geometric data structures. The parallel model that we use is based on a new heterogeneous parallel model named HBSP, which is based on BSP and is introduced here. ParLeda uses two main lib...
متن کاملParallel Spatial Pyramid Match Kernel Algorithm for Object Recognition using a Cluster of Computers
This paper parallelizes the spatial pyramid match kernel (SPK) implementation. SPK is one of the most usable kernel methods, along with support vector machine classifier, with high accuracy in object recognition. MATLAB parallel computing toolbox has been used to parallelize SPK. In this implementation, MATLAB Message Passing Interface (MPI) functions and features included in the toolbox help u...
متن کاملPerformance Analysis of Parallel Applications under Message Passing Environments
We present a view on building a performance analysis tools for parallel applications running on networked workstations under message passing environments (PVM and MPI). Instrumenting a parallel program's components is carried out with a graphical tool. An execution trace is processed using a special trace handling language. A series of metrics and visualizations help infer about application beh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Scientific Computing
دوره 20 شماره
صفحات -
تاریخ انتشار 1998